well-founded - definition. What is well-founded
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

%ما هو (من)٪ 1 - تعريف

TYPE OF BINARY RELATION
Well-founded set; Well-founded; Wellfounded; Well-foundedness; Well-founded order; Well-founded induction; Well-founded relations; Wellfounded relation; Noetherian induction; Hereditarily well-founded set; Well-founded recursion; Wellfounded recursion; Noetherian recursion; Wellfounded induction; Wellfoundedness; Noetherian relation; Well founded; Foundational relation

well-founded         
a.
1.
Authentic.
2.
Well-grounded.
well-founded         
also well founded
If you say that a report, opinion, or feeling is well-founded, you mean that it is based on facts and can therefore be justified.
If the reports are well founded, the incident could seriously aggravate relations between the two nations...
ADJ
well founded         
¦ adjective based on good evidence or reasons.

ويكيبيديا

Well-founded relation

In mathematics, a binary relation R is called well-founded (or wellfounded or foundational) on a class X if every non-empty subset SX has a minimal element with respect to R, that is, an element mS not related by s R m (for instance, "s is not smaller than m") for any sS. In other words, a relation is well founded if

Some authors include an extra condition that R is set-like, i.e., that the elements less than any given element form a set.

Equivalently, assuming the axiom of dependent choice, a relation is well-founded when it contains no infinite descending chains, which can be proved when there is no infinite sequence x0, x1, x2, ... of elements of X such that xn+1 R xn for every natural number n.

In order theory, a partial order is called well-founded if the corresponding strict order is a well-founded relation. If the order is a total order then it is called a well-order.

In set theory, a set x is called a well-founded set if the set membership relation is well-founded on the transitive closure of x. The axiom of regularity, which is one of the axioms of Zermelo–Fraenkel set theory, asserts that all sets are well-founded.

A relation R is converse well-founded, upwards well-founded or Noetherian on X, if the converse relation R−1 is well-founded on X. In this case R is also said to satisfy the ascending chain condition. In the context of rewriting systems, a Noetherian relation is also called terminating.

أمثلة من مجموعة نصية لـ٪ 1
1. But according to Peter McKay, my fears were well founded.
2. But, in fact, this complaint may not be well founded.
3. Russia‘s stance suggests such concerns are well–founded.
4. Ms Hautala‘s worries were well founded, he added.
5. The allegations against Baker, if well founded, could assist us.